Deciding Reachability for 3-Dimensional Multi-Linear Systems
نویسندگان
چکیده
منابع مشابه
Deciding Reachability for 3-Dimensional Multi-Linear Systems
This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the partition, which governs the dynamical behavior of the system within it. The reachability problem for multi-linear systems has been proven to be decidable for...
متن کاملDeciding Reachability for Planar Multi-polynomial Systems
In this paper we investigate the decidability of the reach-ability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a nite number of (polyhedral) regions. To each of these regions is assigned some vector eld which governs the dynamical behaviour of the system within t...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولDeciding Reachability in Mobile Ambients
The calculus of Mobile Ambients has been proposed by Cardelli and Gordon as a foundational model for mobile computing. Since its introduction, the computational strength as well as the decidability of properties have been investigated for several fragments and variants of the standard calculus. We tackle the problem of reachability and we characterize a maximal public (i.e., restriction free) f...
متن کاملReachability in Linear Dynamical Systems
Dynamical systems allow to modelize various phenomena or processes by only describing their local behaviour. It is however useful to understand the behaviour in a more global way. Checking the reachability of a point for example is a fundamental problem. In this document we will show that this problem that is undecidable in the general case is in fact decidable for a natural class of continuous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.54.18